CVI.—The yellow colouring principles of various tannin matters

نویسندگان

چکیده

برای دانلود باید عضویت طلایی داشته باشید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Investigation of Tannin content in Diospyros mespiliformis Extract using Various Extraction Solvents

Plants produce many bioactive compounds that are called secondary metabolites, and have a wide variation in chemical diversity, distribution and function [1]. Phytochemistry of plants has revealed the pharmacological effect and their uses in industries [2-4]. Secondary metabolites have long been known as a source of effective medical therapies such as anti-bacterial and anti-cancer as reported ...

متن کامل

Investigation of Tannin content in Diospyros mespiliformis Extract using Various Extraction Solvents

Plants produce many bioactive compounds that are called secondary metabolites, and have a wide variation in chemical diversity, distribution and function [1]. Phytochemistry of plants has revealed the pharmacological effect and their uses in industries [2-4]. Secondary metabolites have long been known as a source of effective medical therapies such as anti-bacterial and anti-cancer as reported ...

متن کامل

Colouring graphs with bounded generalized colouring number

Given a graph G and a positive integer p, χp(G) is the minimum number of colours needed to colour the vertices of G so that for any i ≤ p, any subgraph H of G of tree-depth i gets at least i colours. This paper proves an upper bound for χp(G) in terms of the k-colouring number colk(G) of G for k = 2p−2. Conversely, for each integer k, we also prove an upper bound for colk(G) in terms of χk+2(G)...

متن کامل

Edge-colouring and total-colouring chordless graphs

A graph G is chordless if no cycle in G has a chord. In the present work we investigate the chromatic index and total chromatic number of chordless graphs. We describe a known decomposition result for chordless graphs and use it to establish that every chordless graph of maximum degree ∆ ≥ 3 has chromatic index ∆ and total chromatic number ∆+1. The proofs are algorithmic in the sense that we ac...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: J. Chem. Soc., Trans.

سال: 1897

ISSN: 0368-1645

DOI: 10.1039/ct8977101131